Complex Multiplication Reduction in Fft Processors
نویسندگان
چکیده
The number of multiplications has been used as a key metrics for comparing FFT algorithms since it has a large impact on the execution time and total power consumption. In this paper, we present a 16-point FFT Butterfly PE, which reduces the multiplicative complexity by using real, constant multiplications. A 1024-point FFT processor has been implemented using 16-point and 4-point Butterfly PEs and simulation result shows that it significantly reduces the power consumption.
منابع مشابه
ASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm
Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...
متن کاملDesign of Low Power Fft Processors Using Multiplier Less Architecture
In this paper, we present a novel restructured coefficient ordering based 16 point pipelined FFT processor. The projected novel FFT has been designed with the use of fixed radix-4 and single path pipelined architecture. Higher throughput rate is gained from this pipelined architecture when compared to ordinary pipelined architecture. The power consumption issue is fixed by reducing the switchin...
متن کاملOptimum Complexity FFT Algorithms for RISC Processors
Modern RISC processors provide a special instruction { the fused multiplyadd (FMA) instruction a b c { to perform both a multiplication and an addition operation at the same time. In this paper newly developed radix-2, radix-4, and split-radix FFT algorithms that optimally take advantage of this powerful instruction are presented. All oating-point operations of these algorithms are executed as ...
متن کاملFPGA Implementation of a Novel Efficient Vedic FFT/IFFT Processor For OFDM
ABSTRACT: Several new generation wideband data communication systems nowadays, have adopted Orthogonal Frequency division Multiplexing technique. FFT/IFFT is one of the main kernel in the OFDM system, therefore, special attention needs to be given to optimize the FFT block. Hence, utilizing low power, area efficient as well as high speed multipliers and adders in Fast Fourier Transform will ens...
متن کاملAccelerating Fully Homomorphic Encryption on GPUs
In a major breakthrough, in 2009 Gentry introduced the first plausible construction of a fully homomorphic encryption (FHE) scheme. FHE allows the evaluation of arbitrary functions directly on encrypted data on untwisted servers. In 2010, Gentry and Halevi presented the first FHE implementation on an IBM x3500 server. However, this implementation remains impractical due to the high latency of e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999